On an inverse Cayley problem

نویسندگان

  • John McCabe
  • Kathryn Weld
چکیده

Let G be a group. We will call G a group with Cayley data if we are given all three of the following: the underlying set G; the collection of all Cayley sets of G; and for each Cayley subset S of G, the corresponding Cayley graph Cay(G,S). Is it then possible, from the Cayley data, to reconstruct the binary operation of the group? Is it possible to determine the isomorphism class of the group? We show that there are groups for which the reconstruction of the group operation is not possible, and we call such a group an ambiguous group. We completely characterize ambiguous groups, discuss some properties of the associated Cayley graphs, and we show that the Cayley data for any group does determine the isomorphism class of the group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A structured approach to design-for-frequency problems using the Cayley-Hamilton theorem

An inverse eigenvalue problem approach to system design is considered. The Cayley-Hamilton theorem is developed for the general case involving the generalized eigenvalue vibration problem. Since many solutions exist for a desired frequency spectrum, a discussion of the required design information and suggestions for including structural constraints are given. An algorithm for solving the invers...

متن کامل

An Inexact Cayley Transform Method For Inverse Eigenvalue Problems

The Cayley transform method is a Newton-like method for solving inverse eigenvalue problems. If the problem is large, one can solve the Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations than is required for the convergence of the Newton (outer) iterations. In this paper, we develop an inexa...

متن کامل

Cayley Color Graphs of Inverse Semigroups and Groupoids

The notion of Cayley color graphs of groups is generalized to inverse semigroups and groupoids. The set of partial automorphisms of the Cayley color graph of an inverse semigroup or a groupoid is isomorphic to the original inverse semigroup or groupoid. The groupoid of color permuting partial automorphisms of the Cayley color graph of a transitive groupoid is isomorphic to the original groupoid.

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

AN INVERSE PROBLEM WITH UNKNOWN RADIATION TERM

In this paper, we consider an inverse problem of linear heat equation with nonlinear boundary condition. We identify the temperature and the unknown radiation tern from an overspecified condition on the boundary

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2009